Solution of Nonsmooth Generalized Complementarity Problems
نویسنده
چکیده
We consider an unconstrained minimization reformulation of the generalized complementarity problem GCP(f, g) when the underlying functions f and g are H-differentiable. We describe H-differentials of some GCP functions based on the min function and the penalized Fischer-Burmeister function, and their merit functions. Under appropriate semimonotone (E0), strictly semimonotone (E) regularity-conditions on the H-differentials of f and g, we show that a local/global minimum of a merit function (or a ‘stationary point’ of a merit function) is coincident with the solution of the given generalized complementarity problem. When specialized GCP(f, g) to the nonlinear complementarity problems, our results not only give new results but also extend/unify various similar results proved for C, semismooth, and locally Lipschitzian.
منابع مشابه
Global and Local Superlinear Convergence Analysis of Newton - TypeMethods for Semismooth Equations with Smooth Least
The local superlinear convergence of the generalized Newton method for solving systems of nonsmooth equations has been proved by Qi and Sun under the semismooth condition and nonsingularity of the generalized Jacobian at the solution. Unlike the Newton method for systems of smooth equations, globalization of the generalized Newton method seems dif-cult to achieve in general. However, we show th...
متن کاملA parameterized Newton method and a quasi-Newton method for nonsmooth equations
This paper presents a parameterized Newton method using generalized Jacobians and a Broyden-like method for solving nonsmooth equations. The former ensures that the method is well-deened even when the generalized Jacobian is singular. The latter is constructed by using an approximation function which can be formed for nonsmooth equations arising from partial diierential equations and nonlinear ...
متن کاملA nonsmooth inexact Newton method for the solution oflarge - scale nonlinear complementarity
A new algorithm for the solution of large-scale nonlinear complementarity problems is introduced. The algorithm is based on a nonsmooth equation reformulation of the complementarity problem and on an inexact Levenberg-Marquardt-type algorithm for its solution. Under mild assumptions, and requiring only the approximate solution of a linear system at each iteration, the algorithm is shown to be b...
متن کاملConvergence of Newton's Method for Singular Smooth and Nonsmooth Equations Using Adaptive Outer Inverses
We present a local convergence analysis of generalized Newton methods for singular smooth and nonsmooth operator equations using adaptive constructs of outer inverses. We prove that for a solution x of F(x) = 0, there exists a ball S = S(x ; r), r > 0 such that for any starting point x 0 2 S the method converges to a solution x 2 S of ?F (x) = 0, where ? is a bounded linear operator that depend...
متن کاملOn Properties of Newton's Method for Smooth and Nonsmooth Equations1
Variational inequalities, nonlinear programming, complementarity problems and other problems can be reduced to nonsmooth equations, for which some generalizations of Newton's method are known. The Newton path, as a natural generalization of the Newton direction, was suggested by D. Ralph for enlarging the convergence region (globalization) of Newton-Robinson's method in the nonsmooth case. We i...
متن کامل